Cingulate Cortex Networks : Role in learning and memory and Alzheimer's disease related changes

VRIJE UNIVERSITEIT CINGULATE CORTEX NETWORKS Role in learning and memory and Alzheimer’s disease related changesScheltens, P. [Promotor]Witter, M.P. [Promotor

Genetic algorithm based software integration with minimum software risk

This paper investigates an approach of integrating software with a minimum risk using Genetic Algorithms (GA). The problem was initially proposed by the need of sharing common software components among various departments within a same organization. Two significant contributions have been made in this study: (1) an assimilation exchange based software integration approach is proposed; (2) the software integration problem is formulated as a search problem and solved by using a GA. A case study is based on an on-going software integration project carried out in the Derbyshire Fire Rescue Service, and used to illustrate the application of the approach

A fuzzy multi-objective programming for optimization of fire station locations through genetic algorithms

Location of fire stations is an important factor in its fire protection capability. This paper aims to determine the optimal location of fire station facilities. The proposed method is the combination of a fuzzy multi-objective programming and a genetic algorithm. The original fuzzy multiple objectives are appropriately converted to a single unified 'min-max' goal, which makes it easy to apply a genetic algorithm for the problem solving. Compared with the existing methods of fire station location our approach has three distinguish features: (1) considering fuzzy nature of a decision maker (DM) in the location optimization model; (2) fully considering the demands for the facilities from the areas with various fire risk categories; (3) being more understandable and practical to DM. The case study was based on the data collected from the Derbyshire fire and rescue service and used to illustrate the application of the method for the optimization of fire station locations. © 2006 Elsevier B.V. All rights reserved

Proximal lava drainage controls on basaltic fissure eruption dynamics

Hawaiian basaltic eruptions commonly initiate as a fissure, producing fountains, spattering, and clastogenic lava flows. Most fissures rapidly localize to form a small number of eruptive vents, the location of which may influence the subsequent distribution of lava flows and associated hazards. We present results from a detailed field investigation of the proximal deposits of episode 1 of the 1969 fissure eruption of Mauna Ulu, Kīlauea, Hawai‘i. Exceptional preservation of the deposits allows us to reconstruct vent-proximal lava drainage patterns and to assess the role that drainage played in constraining vent localization. Through detailed field mapping, including measurements of the height and internal depth of lava tree moulds, we reconstruct high-resolution topographic maps of the pre-eruption ground surface, the lava high-stand surface and the post-eruption ground surface. We calculate the difference in elevation between pairs of maps to estimate the lava inundation depth and lava drainage depth over the field area and along different segments of fissure. Aerial photographs collected during episode 1 of the eruption allow us to locate those parts of the fissure that are no longer exposed at the surface. By comparing with the inundation and drainage maps, we find that fissure segments that were inundated with lava to greater depths (typically 1–6 m) during the eruption later became foci of lava drainage back into the fissure (internal drain-back). We infer that, in these areas, lava ponding over the fissure suppressed discharge of magma, thereby favouring drain-back and stagnation. By contrast, segments with relatively shallow inundation (typically less than ~ 1 m), such as where the fissure intersects pre-eruptive topographic highs, or where flow away from the vent (outflow) was efficient, are often associated with sub-circular vent geometries in the post-eruption ground surface. We infer that these parts of the fissure became localization points for ongoing magma ascent and discharge. We conclude that lava inundation and drainage processes in basaltic fissure eruptions can play an important role in controlling their localization and longevity

Finding co-solvers on Twitter, with a little help from Linked Data

In this paper we propose a method for suggesting potential collaborators for solving innovation challenges online, based on their competence, similarity of interests and social proximity with the user. We rely on Linked Data to derive a measure of semantic relatedness that we use to enrich both user profiles and innovation problems with additional relevant topics, thereby improving the performance of co-solver recommendation. We evaluate this approach against state of the art methods for query enrichment based on the distribution of topics in user profiles, and demonstrate its usefulness in recommending collaborators that are both complementary in competence and compatible with the user. Our experiments are grounded using data from the social networking service Twitter.com

Results of the First Coincident Observations by Two Laser-Interferometric Gravitational Wave Detectors

We report an upper bound on the strain amplitude of gravitational wave bursts in a waveband from around 800Hz to 1.25kHz. In an effective coincident observing period of 62 hours, the prototype laser interferometric gravitational wave detectors of the University of Glasgow and Max Planck Institute for Quantum Optics, have set a limit of 4.9E-16, averaging over wave polarizations and incident directions. This is roughly a factor of 2 worse than the theoretical best limit that the detectors could have set, the excess being due to unmodelled non-Gaussian noise. The experiment has demonstrated the viability of the kind of observations planned for the large-scale interferometers that should be on-line in a few years time.Comment: 11 pages, 2 postscript figure

Estimating the feasibility of transition paths in extended finite state machines

There has been significant interest in automating testing on the basis of an extended finite state machine (EFSM) model of the required behaviour of the implementation under test (IUT). Many test criteria require that certain parts of the EFSM are executed. For example, we may want to execute every transition of the EFSM. In order to find a test suite (set of input sequences) that achieves this we might first derive a set of paths through the EFSM that satisfy the criterion using, for example, algorithms from graph theory. We then attempt to produce input sequences that trigger these paths. Unfortunately, however, the EFSM might have infeasible paths and the problem of determining whether a path is feasible is generally undecidable. This paper describes an approach in which a fitness function is used to estimate how easy it is to find an input sequence to trigger a given path through an EFSM. Such a fitness function could be used in a search-based approach in which we search for a path with good fitness that achieves a test objective, such as executing a particular transition, and then search for an input sequence that triggers the path. If this second search fails then we search for another path with good fitness and repeat the process. We give a computationally inexpensive approach (fitness function) that estimates the feasibility of a path. In order to evaluate this fitness function we compared the fitness of a path with the ease with which an input sequence can be produced using search to trigger the path and we used random sampling in order to estimate this. The empirical evidence suggests that a reasonably good correlation (0.72 and 0.62) exists between the fitness of a path, produced using the proposed fitness function, and an estimate of the ease with which we can randomly generate an input sequence to trigger the path

Pre-main-sequence Lithium Depletion

In this review I briefly discuss the theory of pre-main-sequence (PMS) Li depletion in low-mass (0.075<M<1.2 Msun) stars and highlight those uncertain parameters which lead to substantial differences in model predictions. I then summarise observations of PMS stars in very young open clusters, clusters that have just reached the ZAMS and briefly highlight recent developments in the observation of Li in very low-mass PMS stars.Comment: 8 pages, invited review at "Chemical abundances and mixing in stars in the Milky Way and its satellites", eds. L. Pasquini, S. Randich. ESO Astrophysics Symposium (Springer-Verlag

The communication complexity of non-signaling distributions

We study a model of communication complexity that encompasses many well-studied problems, including classical and quantum communication complexity, the complexity of simulating distributions arising from bipartite measurements of shared quantum states, and XOR games. In this model, Alice gets an input x, Bob gets an input y, and their goal is to each produce an output a,b distributed according to some pre-specified joint distribution p(a,b|x,y). We introduce a new technique based on affine combinations of lower-complexity distributions. Specifically, we introduce two complexity measures, one which gives lower bounds on classical communication, and one for quantum communication. These measures can be expressed as convex optimization problems. We show that the dual formulations have a striking interpretation, since they coincide with maximum violations of Bell and Tsirelson inequalities. The dual expressions are closely related to the winning probability of XOR games. These lower bounds subsume many known communication complexity lower bound methods, most notably the recent lower bounds of Linial and Shraibman for the special case of Boolean functions. We show that the gap between the quantum and classical lower bounds is at most linear in the size of the support of the distribution, and does not depend on the size of the inputs. This translates into a bound on the gap between maximal Bell and Tsirelson inequality violations, which was previously known only for the case of distributions with Boolean outcomes and uniform marginals. Finally, we give an exponential upper bound on quantum and classical communication complexity in the simultaneous messages model, for any non-signaling distribution. One consequence is a simple proof that any quantum distribution can be approximated with a constant number of bits of communication.Comment: 23 pages. V2: major modifications, extensions and additions compared to V1. V3 (21 pages): proofs have been updated and simplified, particularly Theorem 10 and Theorem 22. V4 (23 pages): Section 3.1 has been rewritten (in particular Lemma 10 and its proof), and various minor modifications have been made. V5 (24 pages): various modifications in the presentatio